Efficiently Mining Maximal Frequent Itemsets
نویسندگان
چکیده
We present GenMax, a backtrack search based algorithm for mining maximal frequent itemsets. GenMax uses a number of optimizations to prune the search space. It uses a novel technique called progressive focusing to perform maximality checking, and diffset propagation to perform fast frequency computation. Systematic experimental comparison with previous work indicates that different methods have varying strengths and weaknesses based on dataset characteristics. We found GenMax to be a highly efficient method to mine the exact set of maximal patterns.
منابع مشابه
Maximal frequent itemset generation using segmentation approach
Finding frequent itemsets in a data source is a fundamental operation behind Association Rule Mining. Generally, many algorithms use either the bottom-up or top-down approaches for finding these frequent itemsets. When the length of frequent itemsets to be found is large, the traditional algorithms find all the frequent itemsets from 1-length to n-length, which is a difficult process. This prob...
متن کاملA comprehensive method for discovering the maximal frequent set
The association rule mining can be divided into two steps.The first step is to find out all frequent itemsets, whose occurrences are greater than or equal to the user-specified threshold.The second step is to generate reliable association rules based on all frequent itemsets found in the first step. Identifying all frequent itemsets in a large database dominates the overall performance in the a...
متن کاملMaximal Frequent Itemsets Mining Using Database Encoding
Frequent itemsets mining is a classic problem in data mining and plays an important role in data mining research for over a decade. However, the mining of the all frequent itemsets will lead to a massive number of itemsets. Fortunately, this problem can be reduced to the mining of maximal frequent itemsets. In this paper, we propose a new method for mining maximal frequent itemsets. Our method ...
متن کاملA Simple but Effective Maximal Frequent Itemset Mining Algorithm over Streams
Maximal frequent itemsets are one of several condensed representations of frequent itemsets, which store most of the information contained in frequent itemsets using less space, thus being more suitable for stream mining. This paper considers a simple but effective algorithm for mining maximal frequent itemsets over a stream landmark. We design a compact data structure named FP-FOREST to improv...
متن کاملAn Improved Mining Algorithm of Maximal Frequent Itemsets
Mining maximal frequent itemsets is very important in many data mining applications. How to improve the efficiency and effectiveness of mining algorithm has become an interesting issue in the world. In this paper, we introduce a new method to solve this problem, which is based on graph theory. Firstly, the concept of directed itemsets graph and the trifurcate linked list storage structure are p...
متن کامل